منابع مشابه
Sharing Information in Parallel Search with Search Space Partitioning
Recent computing architecture turned parallel. A single CPU now provides up to 16 cores. These computing resources should also be exploited for solving search problems, for example the well researched SAT problem. In this paper we show how information can be shared in a parallel SAT solver that relies on search space partitioning via iterative partitioning. With improved clause sharing, 12 more...
متن کاملFast Information Distribution for Massively Parallel IDA* Search
Search permeates all aspects of artificial intelligence including problem solving, robot motion planning, concept learning, theorem proving, and natural language understanding [12]. Because search routines are frequently also a computational bottleneck, numerous methods have been explored to increase the efficiency of search by making use of background knowledge, search macro operators, and par...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولSearch asymmetries: Parallel processing of uncertain sensory information
What is the mechanism underlying search phenomena such as search asymmetry? Two-stage models such as Feature Integration Theory and Guided Search propose parallel pre-attentive processing followed by serial post-attentive processing. They claim search asymmetry effects are indicative of finding pairs of features, one processed in parallel, the other in serial. An alternative proposal is that a ...
متن کاملInformation-limited parallel processing in difficult heterogeneous covert visual search.
Difficult visual search is often attributed to time-limited serial attention operations, although neural computations in the early visual system are parallel. Using probabilistic search models (Dosher, Han, & Lu, 2004) and a full time-course analysis of the dynamics of covert visual search, we distinguish unlimited capacity parallel versus serial search mechanisms. Performance is measured for d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2019
ISSN: 1556-5068
DOI: 10.2139/ssrn.3389057